#include "RBTree.h"
#include <vector>

int main()
{
	const int N = 1000000;
	vector<int> v;
	v.reserve(N);
	srand(time(0));

	for (size_t i = 0; i < N; i++)
	{
		v.push_back(rand());
	}

	// vector<int> v = {16, 3, 7, 11, 9, 26, 18, 14, 15};
	// vector<int> v = {4, 2, 6, 1, 3, 5, 15, 7, 16, 14};

	RBTree<int, int> t;
	for (auto e : v)
	{
		t.Insert(make_pair(e, e));
		// cout << "Insert:" << e << "->" << t.Isbalance() << endl;
	}

	return 0;
}